منابع مشابه
Shapely Hierarchical Graph Transformation
Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles t...
متن کاملHierarchical Graph Transformation †
Hierarchical Graph Transformation Gio r g i o Bu s a t t o Carl v. Ossietzky Universität Fachbereich Informatik 26111 Oldenburg email: [email protected] Han s J ö r g K r e ow sk i, S ab i n e Ku sk e University of Bremen Department of Computer Science P.O. Box 330440 D-28334 Bremen email: {kreo,kuske}@informatik.uni-bremen.de
متن کاملHierarchical Graph Transformation
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from fla...
متن کاملParallel Independence in Hierarchical Graph Transformation
Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps H ⇐ G ⇒ H ′ can be joined by subsequent transformation sequences H ∗ ⇒ M ∗ ⇐ ...
متن کاملModeling a Service and Session Calculus with Hierarchical Graph Transformation
Graph transformation techniques have been applied successfully to the modelling of process calculi, for example for equipping them with a truly concurrent semantics. Recently, there has been an increasing interest towards hierarchical structures both at the level of graph-based models, in order to represent explicitly the interplay between linking and containment (like in Milner’s bigraphs), an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2002
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1790